Evaluation Evaluation of Small Elements of the Eigenvectors of Certain Symmetric Tridiagonal Matrices with High Relative Accuracy
نویسنده
چکیده
of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with high relative accuracy. Nevertheless, in general, each coordinate of the eigenvector is evaluated with only high absolute accuracy. In particular, those coordinates whose magnitude is below the machine precision are not expected to be evaluated to any correct digit at all. In this paper, we address the problem of evaluating small (e.g. 10 −50) coordinates of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy. We propose a numerical algorithm to solve this problem, and carry out error analysis. Also, we discuss some applications in which this task is necessary. Our results are illustrated via several numerical experiments.
منابع مشابه
An O(N2 ) Method for Computing the Eigensystem of N ˟ N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
An efficient method to solve the eigenproblem of N x N symmetric tridiagonal matrices is proposed. Unlike the standard eigensolvers that necessitate O(N3) operations to compute the eigenvectors of such matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N2) operations. The method is based on serial implementation of the recently introduced Divide and Conquer...
متن کاملOn Computing the Eigenvectors of Symmetric Tridiagonal and Semiseparable Matrices
A real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used approach to compute the spectrum of such matrices reduces first the dense symmetric matrix into a symmetric structured one, i.e., either a tridiagonal matrix [2, 3] or a semiseparable matrix [4]. This step is accomplished in O(n) operations. Once the latter symmetric structured matrix is available, its s...
متن کاملA New O(n^2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem
A New O(n) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem by Inderjit Singh Dhillon Doctor of Philosophy in Computer Science University of California, Berkeley Professor James W. Demmel, Chair Computing the eigenvalues and orthogonal eigenvectors of an n n symmetric tridiagonal matrix is an important task that arises while solving any symmetric eigenproblem. All practica...
متن کاملThe Inverse Eigenvector Problem for Real Tridiagonal Matrices
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is presented. With its help we can define necessary and sufficient conditions for the unique real tridiagonal matrix for which an approximate pair of complex eigenvectors are exact. Similarly we can designate the unique real tridiagonal matrix for which two approximate real eigenvectors, with differe...
متن کاملTridiagonal Realization of the Anti-symmetric Gaussian Β-ensemble
Abstract. The Householder reduction of a member of the anti-symmetric Gaussian unitary ensemble gives an anti-symmetric tridiagonal matrix with all independent elements. The random variables permit the introduction of a positive parameter β, and the eigenvalue probability density function of the corresponding random matrices can be computed explicitly, as can the distribution of {qi}, the first...
متن کامل